direct mine discrimin essenti frequent pattern model base search tree wei fan kun zhang hong cheng jing gao xifeng yan jiawei han philip yu olivi verscheur frequent pattern provid solut dataset structur featur vector frequent pattern mine trivial number uniqu pattern exponenti discrimin correl frequent pattern mine perform sequenti step enumer set frequent pattern featur select method propos past year perform separ step effici limit success eventu find highli compact discrimin pattern culprit due inher natur wide adopt step approach paper discuss problem propos method build decis tree partit data node node directli discov discrimin pattern divid exampl purer subset number exampl leaf level small approach examin pattern extrem low global support enumer dataset step method discov featur vector accur difficult graph frequent itemset problem recent propos algorithm total size typic smaller importantli minimum support discrimin pattern extrem low order enumer low support pattern state art frequent pattern algorithm finish due huge memori consumpt enumer time pattern found softwar dataset contact author 